| 翻訳と辞書 |
Peter Shor
| known_for = Shor's algorithm
}}
Peter Williston Shor (born August 14, 1959) is an American professor of applied mathematics at MIT, most famous for his work on quantum computation, in particular for devising Shor's algorithm, a quantum algorithm for factoring exponentially faster than the best currently-known algorithm running on a classical computer.
== Education ==
While attending Tamalpais High School, in Mill Valley, California, he placed third in the 1977 USA Mathematical Olympiad.〔(Murray Klamkin (Editor). Mathematical Association of America (January 1989). ''USA Mathematical Olympiads 1972-1986 Problems and Solutions'' (Anneli Lax New Mathematical Library) ), ISBN 0-88385-634-4
ISBN 978-0-88385-634-5, accessed May 10, 2007〕 After graduating that year, he won a silver medal at the International Math Olympiad in Yugoslavia (the U.S. team achieved the most points per country that year).〔(Mill Valley Historical Society, 2004, 'History of Homestead Valley' )〕〔(Stephen R. Dunbar, 'Identifying Talent: American Mathematics Competitions,' in Mathematical Association of America, Focus, Vol 24, Issue 3, March 2004, p 29 )〕 He received his B.S. in Mathematics in 1981 for undergraduate work at Caltech, and was a Putnam Fellow in 1978. He earned his Ph.D. in Applied Mathematics from MIT in 1985.〔Shor, Peter Williston, ("Random Planar Matching and Bin Packing" ), Ph.D. thesis, MIT, September 1985〕 His doctoral advisor was F. Thomson Leighton, and his thesis was on probabilistic analysis of bin-packing algorithms.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Peter Shor」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|